Shift invariant algebras, Segre products and regular languages
نویسندگان
چکیده
Motivated by results on the rationality of equivariant Hilbert series some hierarchical models in algebraic statistics we introduce Segre product formal languages and apply it to establish new cases. To this end show that two regular is again regular. We also prove every filtration algebras given as a tensor families with rational has series. The term used broadly include action monoid nonnegative integers shifting variables. Furthermore, exhibit shift invariant monomial series, but whose presentation ideals do not stabilize.
منابع مشابه
Kleene Algebras, Regular Languages and Substructural Logics
We introduce the two substructural propositional logics KL, KL, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof. We also prove strong completeness for language models, where each logic comes with a different interpretation. We show that for both logics the...
متن کاملSpecification Languages for Stutter-Invariant Regular Properties
We present specification languages that naturally capture exactly the regular and ω-regular properties that are stutter invariant. Our specification languages are variants of the classical regular expressions and of the core of PSL, a temporal logic, which is widely used in industry and which extends the classical linear-time temporal logic LTL by semi-extended regular expressions.
متن کاملRegular tree languages, cardinality predicates, and addition-invariant FO
This paper considers the logic FOcard, i.e., first-order logic with cardinality predicates that can specify the size of a structure modulo some number. We study the expressive power of FOcard on the class of languages of ranked, finite, labelled trees with successor relations. Our first main result characterises the class of FOcard-definable tree languages in terms of algebraic closure properti...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملClassifying Regular Languages via Cascade Products of Automata
A significant result in the structure theory of regular languages is the Krohn-Rhodes Theorem, which states that any finite automaton can be decomposed into simple “prime factors”. This theorem can be stated in different versions using different products on different structures, namely the cascade product of automata, the wreath product of transformation semigroups and the block product of semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2023
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2023.04.016